An Algebra of Synchronous Scheduling Interfaces
نویسنده
چکیده
In this paper we propose an algebra of synchronous scheduling interfaces which combines the expressiveness of Boolean algebra for logical and functional behaviour with the min-max-plus arithmetic for quantifying the non-functional aspects of synchronous interfaces. The interface theory arises from a realisability interpretation of intuitionistic modal logic (also known as Curry-Howard-Isomorphism or propositions-as-types principle). The resulting algebra of interface types aims to provide a general setting for specifying type-directed and compositional analyses of worst-case scheduling bounds. It covers synchronous control flow under concurrent, multi-processing or multi-threading execution and permits precise statements about exactness and coverage of the analyses supporting a variety of abstractions. The paper illustrates the expressiveness of the algebra by way of some examples taken from network flow problems, shortest-path, task scheduling and worst-case reaction times in synchronous programming.
منابع مشابه
Design and Implementation of a High-Precision Position Controller for Permanent Magnet Synchronous Motor Based on a New Gain Scheduling Approach
The direct drive permanent magnet synchronous motor (DD-PMSM) is a suitable choice for high-precision position control applications. Among various control methods of this motor, the vector control approaches especially the field oriented control has a high-performance in the industrial drives. In this method, the components of stator current are controlled independently and as a result, the tor...
متن کاملAn Algebra of Behavioural Types
We propose a process algebra, the Algebra of Behavioural Types. A type is a higher-order labelled transition system that characterises all possible life cycles of a concurrent object. States represent interfaces of objects; state transitions model the dynamic change of object interfaces. Moreover, a type provides an internal view of the objects that inhabit it: a synchronous one, since transiti...
متن کاملSynchronous Interface Theories and Time Triggered Scheduling
We propose synchronous interfaces, a new interface theory for discrete-time systems. We use an application to time-triggered scheduling to drive the design choices for our formalism; in particular, additionally to deriving useful mathematical properties, we focus on providing a syntax which is adapted to natural high-level system modeling. As a result, we develop an interface model that relies ...
متن کاملParallel Computer Algebra1
2 Building and implementing parallel algorithms in the area of computer algebra has become an important thread of research for more than a decade with the increasing availability of various parallel architectures, from dedicated machines to network of workstations. New algorithms have been built and implemented to solve high performance computing challenges. The aim of this tutorial is to give ...
متن کاملCausality Interfaces and Compositional Causality Analysis 1 Edward
In this paper, we consider concurrent models of computation where ”actors” (components that are in charge of their own actions) communicate by exchanging messages. The interfaces of actors principally consist of “ports,” which mediate the exchange of messages. Actor-oriented architectures contrast with and complement object-oriented models by emphasizing the exchange of data between concurrent ...
متن کامل